Exponential Lower Bounds on the Size ofOBDDs Representing
نویسندگان
چکیده
An Ordered Binary Decision Diagram (OBDD) is a directed acyclic graph representing a Boolean function. The size of OBDDs largely depends on the variable ordering. In this paper, we show the size of the OBDD representing the i-th bit of the output of n-bit/n-bit integer division is (2 (n?i)=8) for any variable ordering. We also show that _-OBDDs, ^-OBDDs and-OBDDs representing integer division has the same lower bounds on the size. We develop new methods for proving lower bounds on the size of _-OBDDs, ^-OBDDs and-OBDDs.
منابع مشابه
Capacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference
Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios. First, it is shown that the additive Gaussian ch...
متن کاملKUIS - 96 - 0002 An Exponential Lower Bound of the Size of OBDDs
The size of the Ordered Binary Decision Diagram (OBDD) which represents a Boolean function greatly depends on the ordering of input variables. In this paper, we show that the size of the OBDD representing n-bits integer division is (2 n=8 ) even if any variable ordering is allowed to minimize the size of the OBDD. We also show that _-OBDDs and ^-OBDDs representing division have the same lower b...
متن کاملAn Exponential Lower Bound on the Size of a Binary Moment Diagram Representing Integer Division
A binary moment diagram, which was proposed for arithmetic circuit verification, is a directed acyclic graph representing a function from binary-vectors to integers (f : {0, 1}n → Z). A multiplicative binary moment diagram is an extension of a binary moment diagram with edge weights attached. A multiplicative binary moment diagram can represent addition, multiplication and many other functions ...
متن کاملNew Limits for Knowledge Compilation and Applications to Exact Model Counting
We show new limits on the efficiency of using current techniques to make exact probabilistic inference for large classes of natural problems. In particular we show new lower bounds on knowledge compilation to SDD and DNNF forms. We give strong lower bounds on the complexity of SDD representations by relating SDD size to best-partition communication complexity. We use this relationship to prove ...
متن کاملSize, Cost and Capacity: A Semantic Technique for Hard Random QBFs
As a natural extension of the SAT problem, different proof systems for quantified Boolean formulas (QBF) have been proposed. Many of these extend a propositional system to handle universal quantifiers. By formalising the construction of the QBF proof system P+∀red from a propositional proof system P (Beyersdorff, Bonacina & Chew, ITCS ‘16), we present a new technique for proving proof size lowe...
متن کامل